Input Products for Weighted Extended Top-Down Tree Transducers
نویسنده
چکیده
A weighted tree transformation is a function : T T ! A where T and T are the sets of trees over the ranked alphabets and , respectively, and A is the domain of a semiring. The input and output product of with tree series ' : T ! A and : T ! A are the weighted tree transformations ' / and . , respectively, which are de ned by (' / )(t; u) = '(t) (t; u) and ( . )(t; u) = (t; u) (u) for every t 2 T and u 2 T . In this contribution, input and output products of weighted tree transformations computed by weighted extended top-down tree transducers (wxtt) with recognizable tree series are considered. The classical approach is presented and used to solve the simple cases. It is shown that input products can be computed in three successively more di cult scenarios: nondeleting wxtt, wxtt over idempotent semirings, and weighted top-down tree transducers over rings.
منابع مشابه
Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers
This paper proposes a uniform framework for the development of parsing and translation algorithms for weighted extended (top-down) tree transducers and input strings. The asymptotic time complexity of these algorithms can be improved in practice by exploiting an algorithm for rule factorization in the above transducers.
متن کاملEvery sensible extended top-down tree transducer is a multi bottom-up tree transducer
A tree transformation is sensible if the size of each output tree is uniformly bounded by a linear function in the size of the corresponding input tree. Every sensible tree transformation computed by an arbitrary weighted extended top-down tree transducer can also be computed by a weighted multi bottom-up tree transducer. This further motivates weighted multi bottom-up tree transducers as suita...
متن کاملInternship Report Compositions of Extended Top-down Tree Transducers
Many aspects of machine translation of natural languages can be formalized by employing weighted finite-state (string) transducers [22, 40]. Successful implementations based on this wordor phrasebased approach are, for example, the At&t Fsm toolkit [41], Xerox’s finite-state calculus [24], the Rwth toolkit [23], Carmel [19], and OpenFst [2]. However, the phrase-based approach is not expressive ...
متن کاملSurvey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power
Weighted extended top-down tree transducers (transducteurs généralisés descendants [Arnold, Dauchet: Bi-transductions de forêts. ICALP’76. Edinburgh University Press. 1976]) received renewed interest in the field of Natural Language Processing, where they are used in syntax-based machine translation. This survey presents the foundations for a theoretical analysis of weighted extended top-down t...
متن کاملPushdown Machines for Weighted Context-Free Tree Translation
Synchronous context-free grammars (or: syntax-directed translation schemata) were introduced in the context of compiler construction in the late 1960s [12]. They define string transductions by the simultaneous derivation of an input and an output word. In contrast, modern systems for machine translation of natural language employ weighted tree transformations to account for the grammatical stru...
متن کامل